A POLYNOMIAL-TIME ALGORITHM FOR THE GENERALIZED INDEPENDENT-FLOW PROBLEM
نویسندگان
چکیده
منابع مشابه
A Polynomial-time Algorithm for the Generalized Independent-flow Problem
We consider a compound problem of the generalized minimum-cost flow problem and the independent-flow problem, which we call the generalized independent-flow problem. The generalized minimumcost flow problem is to find a minimum-cost flow in a capacitated network with gains, where each arc flow is multiplied by a gain factor when going through an arc. On the other hand, the independent-flow prob...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولStrongly polynomial algorithm for generalized flow maximization
A strongly polynomial algorithm is given for the generalized flow maximization problem. It uses a new variant of the scaling technique, called continuous scaling. The main measure of progress is that within a strongly polynomial number of steps, an arc can be identified that must be tight in every dual optimal solution, and thus can be contracted. The full version is available on arXiv:1307.680...
متن کاملA Simple Polynomial Time Algorithm for the Generalized LCS Problem with Multiple Substring Exclusive Constraints
In this paper, we present a simple polynomial time algorithm for a generalized longest common subsequence problem with multiple substring exclusion constraints. Given two sequences X and Y of lengths m and n, respectively, and a set of constraint strings P of total length r, we are to find a common subsequence z of X and Y which excludes each of strings in P as a substring and the length of z i...
متن کاملA Polynomial time Algorithm for the Maximum Weight Independent Set Problem on Outerstring Graphs∗
Outerstring graphs are the intersection graphs of curves that lie inside a disk such that each curve intersects the boundary of the disk in one of its endpoints. Outerstring graphs were introduced in 1991 and are amongst the most general classes of intersection graphs studied, including among others, chordal graphs and interval filament graphs. To date no polynomial time algorithm is known for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 2004
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.47.1